//Sat May 21 13:54:52 CDT 2011
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

int dx = { 1, 0, -1, 0 };
int dy = { 0, 1, 0, -1 };

class State {
public:
	int x;
	int y;
	int dir; //0, no doors; 1, horizontal; -1 vertical;
};

class RevolvingDoors {
public:

	int turns(vector<string> map) {
	}

	int bfs(int x1, int y1, int x2, int y2, vector<string> map) {
		init(-1, map);
		queue<State> q;
		State st = { x1, y1, 0 };
		griddist[x1][y1] = 0;
		q.push(st);
		while (!q.empty()) {
			x1 = q.front().x;
			y1 = q.front().y;
		}
	}

	void init(int k, vector<string> map) {
		vector<int> temp(map[0].size(), k);
		griddist = vector<vector<int> > (map.size(), temp);
	}

	vector<vector<int> > griddist;
};

